Lax orthogonal factorisation systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factorisation Systems on Domains

We present a cartesian closed category of continuous domains containing the classical examples of Scott-domains with continuous functions and Berry's dI-domains with stable functions as full cartesian closed subcategories. Furthermore, the category is closed with respect to bilimits and there is an algebraic and a generalised topological description of its morphisms.

متن کامل

Bivariate orthogonal polynomials, 2D Toda lattices and Lax-type pairs

We explore the connection between an infinite system of particles in R2 described by a bi–dimensional version of the Toda equations with the theory of orthogonal polynomials in two variables. We define a 2D Toda lattice in the sense that we consider only one time variable and two space variables describing a mesh of interacting particles over the plane. We show that this 2D Toda lattice is rela...

متن کامل

Cofibrantly generated natural weak factorisation systems

There is an “algebraisation” of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of maps-with-structure, where the extra structure on a map now encodes a choice of liftings with respect to the other class. This extra structure has pleasant consequences: for example, a natural ...

متن کامل

Algebraic Weak Factorisation Systems I: Accessible Awfs

Algebraic weak factorisation systems (awfs) refine weak factorisation systems by requiring that the assignations sending a map to its first and second factors should underlie an interacting comonad–monad pair on the arrow category. We provide a comprehensive treatment of the basic theory of awfs—drawing on work of previous authors—and complete the theory with two main new results. The first pro...

متن کامل

Propositional Lax Logic Propositional Lax Logic

We investigate a peculiar intuitionistic modal logic, called Propositional Lax Logic (PLL), which has promising applications to the formal veri cation of computer hardware. The logic has emerged from an attempt to express correctness `up to' behavioural constraints | a central notion in hardware veri cation | as a logical modality. As a modal logic it is special since it features a single modal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2016

ISSN: 0001-8708

DOI: 10.1016/j.aim.2016.07.028